Calorimetric properties of benzoic acid from 0-degrees to 410-degrees-K

Jumps of Minimal Degrees below 0 0

We show that there is a degree a REA in and low over 0 0 such that no minimal degree below 0 0 jumps to a degree above a. We also show that every nonlow r.e. degree bounds a nonlow minimal degree.

Cupping D20 Enumeration Degrees to 0 e '

In this paper we prove that every nonzero ∆2 e-degree is cuppable to 0e by a 1-generic ∆ 0 2 e-degree (so low and nontotal) and that every nonzero ω-c.e. e-degree is cuppable to 0e by an incomplete

Degrees in $k$-minimal label random recursive trees

This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring

The K-Degrees, Low for K Degrees, and Weakly Low for K Sets

We call A weakly low for K if there is a c such that KA(σ) ≥ K(σ)−c for infinitely many σ; in other words, there are infinitely many strings that A does not help compress. We prove that A is weakly low for K iff Chaitin’s Ω is A-random. This has consequences in the K-degrees and the low for K (i.e., low for random) degrees. Furthermore, we prove that the initial segment prefix-free complexity o...

Total Degrees and Nonsplitting Properties of Enumeration Degrees